Codes and the Cartier Operator
نویسنده
چکیده
In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the Cartier operator. This new class of codes can be regarded as a natural geometric generalisation of classical Goppa codes. In particular, we prove that a well-known property satisfied by classical Goppa codes extends naturally to Cartier codes. We prove general lower bounds for the dimension and the minimum distance of these codes and compare our construction with a classical one: the subfield subcodes of Algebraic Geometry codes. We prove that every Cartier code is contained in a sub-field subcode of an Algebraic Geometry code and that the two constructions have similar asymptotic performances. We also show that some known results on subfield subcodes of Algebraic Geometry codes can be proved nicely by using properties of the Cartier operator and that some known bounds on the dimension of subfield subcodes of Algebraic Geometry codes can be improved thanks to Cartier codes and the Cartier operator.
منابع مشابه
Cartier Isomorphism for Toric Varieties
is an isomorphism. Here F : X −→ X denotes the Frobenius morphism on X and H denotes the a cohomology sheaf of F∗Ω•X . If the variety is not smooth, not much is known about the properties of the Cartier operator and the poor behaviour of the deRham complex in this case makes its study difficult. If one substitutes the deRham complex with the Zariski-deRham complex the situation is better. For e...
متن کاملA note on superspecial and maximal curves
In this note we review a simple criterion, due to Ekedahl, for superspecial curves defined over finite fields.Using this we generalize and give some simple proofs for some well-known superspecial curves.
متن کاملThe Rank of the Cartier Operator on Cyclic Covers of the Projective Line
We give a lower bound on the rank of the Cartier operator of Jacobian varieties of hyperelliptic and superelliptic curves in terms of their genus.
متن کاملAnalysis of disassembled executable codes by abstract interpretation
The aim of this paper is to dene the abstract domain, abstract operator, abstract semantic, the environments and states of disassembled executable codes as well as a way to analysis the disassembled executable codes. Nowadays, static analysis on disassembled code going to grow. Reverse engineering and malware analysis use this technique. Thus, we tried to perform pluralization the requirements ...
متن کاملLinear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator
We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. As applications, we improve the best currently known upper bounds for factoring integers deterministically, and for computing the Cartier-Manin operator of hyperelliptic curves.
متن کامل